A Type of Inverse Minimum Spanning Tree Problem with Fuzzy Edge Weights
نویسندگان
چکیده
Classic inverse minimum spanning tree problem is to make the least edge weight modification such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. Although many applications can be formulated into this problem, fuzzy parameters are met in some real-world applications. In this paper, a type of inverse minimum spanning tree problem with fuzzy edge weights is discussed from an LAN reconstruction problem. Due to significant differences between classic problem and the problem with fuzzy parameters, the concept of fuzzy αminimum spanning tree is initialized. Two fuzzy models, fuzzy α-minimum spanning tree model and credibility maximization model, are presented to formulate the problem according to different decision criteria. A fuzzy simulation for computing credibility is designed and then embedded into a genetic algorithm to produce some hybrid intelligent algorithms to solve the proposed models appropriately.
منابع مشابه
Models for inverse minimum spanning tree problem with fuzzy edge weights
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, a type of fuzzy inverse minimum spanning tree problem is introduced from a LAN reconstruction problem, where the weights of edges are assumed to be fuzzy variables. The concept of fu...
متن کاملThe Inverse Spanning Tree of a Fuzzy Graph Based on Credibility Measure
An inverse spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree. In this paper, based on the notion of fuzzy α-minimum spanning tree, the inverse spanning tree problem with fuzzy edge weights is discussed and formulated as a fuzzy programming model with some chance constraints. It shows that when all the e...
متن کاملTwo Uncertain Programming Models for Inverse Minimum Spanning Tree Problem
An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain α-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming m...
متن کاملModels and hybrid algorithms for inverse minimum spanning tree problem with stochastic edge weights∗
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the inverse minimum spanning tree problem with stochastic edge weights is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tr...
متن کاملA Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
متن کامل